A Cost Effective RSU Placement Strategy for Secured Communication in VANET

Vehicular ad hoc networks (VANETs) enable vehicles to communicate with each other but require efficient and robust routing protocols for their success. In this proposed system, we exploit the infrastructure of Road Side units (RSUs) to efficiently and reliably route packets in VANETs. This system operates by using vehicles to carry and forward messages from a source vehicle to carry and forward messages from a source vehicle to a nearby RSU and, if needed, route these messages through the RSU network and, finally send them from an RSU to the destination vehicle. In that proposed system is mostly critical for users who are far apart and want to communicate using their vehicles' onboard units. It accounts for both access patterns in our placement strategy and formulate this placement problem via an integer linear programming model such that the aggregate throughput in the network can be maximized. The performance of proposed system evaluated using the ns2 simulation platform. The results show that proposed strategy leads to the best performance as compared with the uniformly distributed placement and the hot spot placement. More importantly, this solution needs the least number of RSUs to achieve the maximal aggregate throughput in the network, indicating that our proposed system is indeed a cost effective yet highly efficient placement strategy for vehicular networks.